Lower Bounds on Quantum Query Complexity for Read-Once Formulas with XOR and MUX Operators
نویسندگان
چکیده
منابع مشابه
Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes
We introduce a complexity measure for decision trees called the soft rank, which measures how wellbalanced a given tree is. The soft rank is a somehow relaxed variant of the rank. Among all decision trees of depth d, the complete binary decision tree (the most balanced tree) has maximum soft rank d, the decision list (the most unbalanced tree) has minimum soft rank √ d, and any other trees have...
متن کاملDepth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas
We show lower bounds of Ω( √ n) and Ω(n) on the randomized and quantum communication complexity, respectively, of all nvariable read-once Boolean formulas. Our results complement the recent lower bound ofΩ(n/8) by Leonardos and Saks [LS09] andΩ(n/2 log ) by Jayram, Kopparty and Raghavendra [JKR09] for randomized communication complexity of read-once Boolean formulas with depth d. We obtain our ...
متن کاملLower Bounds on Quantum Query Complexity
Shor’s and Grover’s famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers cannot do, and specifically how to prove limits on their computational power. We cover the main known techniques for proving lower bounds, and exemplify and compare ...
متن کاملDequantizing Read-once Quantum Formulas
Quantum formulas, defined by Yao [FOCS ’93], are the quantum analogs of classical formulas, i.e., classical circuits in which all gates have fanout one. We show that any read-once quantum formula over a gate set that contains all single-qubit gates is equivalent to a read-once classical formula of the same size and depth over an analogous classical gate set. For example, any readonce quantum fo...
متن کاملA lower bound on the quantum query complexity of read-once functions
We establish a lower bound of Ω( √ n) on the bounded-error quantum query complexity of read-once Boolean functions, providing evidence for the conjecture that Ω( √ D(f)) is a lower bound for all Boolean functions. Our technique extends a result of Ambainis, based on the idea that successful computation of a function requires “decoherence” of initially coherently superposed inputs in the query r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2010
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e93.d.280